- complexity range
- ступінь складності; ступінь інтеграції
English-Ukrainian dictionary of microelectronics. 2013.
complexity range
Смотреть что такое "complexity range" в других словарях:
Complexity economics — Economics … Wikipedia
complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… … Universalium
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Model of hierarchical complexity — The model of hierarchical complexity, is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
Model of Hierarchical Complexity — The model of hierarchical complexity is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
New Complexity — In music, the New Complexity is a term dating from the 1980s, principally applied to composers seeking a complex, multi layered interplay of evolutionary processes occurring simultaneously within every dimension of the musical material (Fox 2001) … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Cognitive complexity — Psychology Cognitive psychology Perception … Wikipedia
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
Cognitive Complexity Theory — Cognitive complexity is a psychological characteristic or psychological variable that indicates how complex or simple is the frame and perceptual skill of a person. A person who measures high on cognitive complexity tends to perceive nuances and… … Wikipedia
Long range planning — Planning for the future has had a long history. The East India Company may not have promised to win the whole of the Indian subcontinent as a result of its efforts (though it ultimately did just that), but it certainly did understand it was… … Wikipedia
